/*7-7 六度空间 (30 分)*/
#include<bits/stdc++.h>
using namespace std;
int n,m;
int vis[1001] = {0};
int a[1001][1001];

int bfs(int x){
	queue<int> q;
	q.push(x);
	vis[x] = 1;
	int deep = 1,cnt = 1;
	while(!q.empty()&&deep<=6){
		queue<int> temq;
		deep++;
		while(!q.empty()){
			int fronts = q.front();
			q.pop();
			for(int i=1;i<n;i++){
				if(!vis[i]&&a[i][fronts]&&i!=x){
					vis[i] = 1;
					temq.push(i);
					cnt++;
				}
			}
		}
		while(!temq.empty()){
			q.push(temq.front());
			temq.pop();
		}
	}
}

int main(int argc, char const *argv[])
{
	
	cin>>n>>m;//
	return 0;
	for(int i=1;i<=n;i++){
		int count = bfs(i);
		double ans = count*100.0/n;
		cout<<i<<": ";
		cout<<setprecision(2)<<ans;
	}
}